Knots with g(E(K)) = 2 and . . .

نویسنده

  • TSUYOSHI KOBAYASHI
چکیده

We show that there exist knots K ⊂ S with g(E(K)) = 2 and g(E(K#K#K)) = 6. Together with [5, Theorem 1.5], this proves existence of counterexamples to Morimoto’s Conjecture [10]. This is a special case of [6]. Let Ki (i = 1, 2) be knots in the 3-sphere S, and let K1#K2 be their connected sum. We use the notation t(·), E(·), and g(·) to denote tunnel number, exterior, and Heegaard genus respectively (we follow the definitions and notations given in [7]). It is well known that the union of a tunnel system for K1, a tunnel system for K2, and a tunnel on a decomposing annulus for K1#K2 forms a tunnel system for K1#K2. Therefore: t(K1#K2) ≤ t(K1) + t(K2) + 1. Since (for any knot K) t(K) = g(E(K))− 1 this gives: (1) g(E(K1#K2)) ≤ g(E(K1)) + g(E(K2)). We say that a knot K in a closed orientable manifold M admits a (g, n) position if there exists a genus g Heegaard surface Σ ⊂ M , separating M into the handlebodies H1 and H2, so that Hi ∩K (i = 1, 2) consists of n arcs that are simultaneously parallel into ∂Hi. It is known [10, Proposition 1.3] that if Ki (i = 1 or 2) admits a (t(Ki), 1) position then equality does not hold: g(E(K1#K2)) < g(E(K1)) + g(E(K2)). Morimoto proved that if K1 and K2 are m-small knots then the converse holds, and conjectured that this holds in general [10, Conjecture 1.5]: Conjecture 1 (Morimoto’s Conjecture). Given knots K1, K2 ⊂ S, g(E(K1#K2)) < g(E(K1)) + g(E(K2)) if and only if for i = 1 or i = 2, Ki admits a (t(Ki), 1) position. We denote the connected sum of n copies of K by nK. We prove: Theorem 2. There exists infinitely many knotsK ⊂ S with g(E(K)) = 2 and g(E(3K)) = 6. Date: April 14, 2008. 1991 Mathematics Subject Classification. 57M99.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Knots with g(E(K)) = 2 and g(E(K#K#K)) = 6 and Morimoto’s Conjecture

We show that there exist knots K ⊂ S with g(E(K)) = 2 and g(E(K#K#K)) = 6. Together with [5, Theorem 1.5], this proves existence of counterexamples to Morimoto’s Conjecture [10]. This is a special case of [6]. Let Ki (i = 1, 2) be knots in the 3-sphere S, and let K1#K2 be their connected sum. We use the notation t(·), E(·), and g(·) to denote tunnel number, exterior, and Heegaard genus respecti...

متن کامل

On the signed Roman edge k-domination in graphs

Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...

متن کامل

Knot Colouring Polynomials

This article introduces a natural extension of colouring numbers of knots, called colouring polynomials, and studies their relationship to Yang-Baxter invariants and quandle 2-cocycle invariants. For a knot K in the 3-sphere let πK be the fundamental group of the knot complement S 3 rK, and let mK , lK ∈ πK be a meridian-longitude pair. Given a finite group G and an element x ∈ G we consider th...

متن کامل

OD-characterization of Almost Simple Groups Related to displaystyle D4(4)

Let $G$ be a finite group and $pi_{e}(G)$ be the set of orders of all elements in $G$. The set $pi_{e}(G)$ determines the prime graph (or Grunberg-Kegel graph) $Gamma(G)$ whose vertex set is $pi(G)$, the set of primes dividing the order of $G$, and two vertices $p$ and $q$ are adjacent if and only if $pqinpi_{e}(G)$. The degree $deg(p)$ of a vertex $pin pi(G)$, is the number of edges incident...

متن کامل

Bounds on the Crosscap Number of Torus Knots

For a torus knot K, we bound the crosscap number c(K) in terms of the genus g(K) and crossing number n(K): c(K) ≤ ⌊(g(K) + 9)/6⌋ and c(K) ≤ ⌊(n(K)+16)/12⌋. The (6n− 2, 3) torus knots show that these bounds are sharp.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007